Discordant Voting Protocols for Cyclically Linked Agents

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Existential Assertions for Voting Protocols

In [22], we extend the Dolev-Yao model with assertions. We build on that work and add existential abstraction to the language, which allows us to translate common constructs used in voting protocols into proof properties. We also give an equivalencebased definition of anonymity in this model, and prove anonymity for the FOO voting protocol.

متن کامل

Cryptographic Protocols for Electronic Voting

Electronic voting has seen a surge of growth in the US over the past five years; yet many questions have been raised about the trustworthiness of today’s e-voting systems. One solution that has been proposed involves use of sophisticated cryptographic protocols to prove to voters that their vote has been recorded and counted correctly. These protocols are of interest both for their use of many ...

متن کامل

Discordant Voting Processes on Finite Graphs

We consider an asynchronous voting process on graphs which we call discordant voting, and which can be described as follows. Initially each vertex holds one of two opinions, red or blue say. Neighbouring vertices with different opinions interact pairwise. After an interaction both vertices have the same colour. The quantity of interest is T , the time to reach consensus, i.e. the number of inte...

متن کامل

Secure Electronic Voting Protocols

This chapter gives a summary of cryptographic e-voting protocols. We start with a motivation and an overview of some aspects of traditional elections. We then outline the security requirements of e-voting and present in detail two approaches to cryptographic e-voting, based on homomorphic encryption and mix networks. We finish the chapter with a list of open problems.

متن کامل

Linear Logical Voting Protocols

Current approaches to electronic implementations of voting protocols involve translating legal text to source code of an imperative programming language. Because the gap between legal text and source code is very large, it is difficult to trust that the program meets its legal specification. In response, we promote linear logic as a high-level language for both specifying and implementing votin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2020

ISSN: 1077-8926

DOI: 10.37236/8578